Subdivision Depth Computation for Tensor Product n-Ary Volumetric Models
نویسندگان
چکیده
and Applied Analysis 3 P 1 2i P 1 2i 1 P 1 2i 2 P i 1 P 1 2i 3 P 1 2i 4 P k i 2 P k i a P 1 3i P 1 3i 1 P 1 3i 2 P i 1 P 1 3i 3 P 1 3i 4 P 1 3i 5 P 1 3i 6 P k i 2 P k i b P 1 4i P 1 4i 1 P 1 4i 2 P k i 1 P 1 4i 3 P 1 4i 4 P 1 4i 5 P 1 4i 6 P 1 4i 7 P 1 4i 8 P k i 2 P k i c Figure 1: Solid lines show coarse polygons whereas doted lines are refined polygons. a – c represent binary, ternary, and quaternary refinement of coarse polygon of scheme 2.1 for n 2, 3, 4, respectively. 2. Preliminaries In this section, first we list all the basic facts about subdivision curve, surface and volumetric models needed in this paper. Then we settle some notations for fair reading and better understanding of Section 3. 2.1. Concepts 2.1.1. n-Ary Subdivision Curve Given a sequence of control points p i ∈ N , i ∈ , N 2, where the upper index k 0 indicates the subdivision level, an n-ary subdivision curve 5 is defined by p 1 ni α m ∑ j 0 aα,jp k i j , α 0, 1, . . . , n − 1, 2.1 where m > 0 and m ∑ j 0 aα,j 1, α 0, 1, . . . , n − 1. 2.2 The set of coefficients {aα,j , α 0, 1, . . . , n − 1}mj 0 is called subdivision mask. Given initial values p0 i ∈ N , i ∈ , then in the limit k → ∞, the process 2.1 defines an infinite set of points in N . The sequence of control points {p i } is related, in a natural way, with the dyadic mesh points tki i/n k , i ∈ . The process then defines a scheme whereby p 1 ni α replaces the value p i α/n for α ∈ {0, n}. Here p k 1 ni α is inserted at the mesh point t k 1 ni α 1/n n−α t k i αt k i 1 for α 0, 1, . . . , n. Labelling of old and new points is shown in Figure 1 which illustrates subdivision scheme 2.1 . 2.1.2. Tensor Product n-Ary Subdivision Surface Given a sequence of control points p i,j ∈ N , i, j ∈ , N 2, where the upper index k 0 indicates the subdivision level, a tensor product n-ary surface is a tensor product of 2.1 defined by p 1 ni α,nj β m ∑ r 0 m ∑ s 0 aα,raβ,sp k i r,j s, α, β 0, 1, . . . , n − 1, 2.3 4 Abstract and Applied Analysis P 1 2i,2j 2
منابع مشابه
A New Approach to Approximating Subdivision Surface Scheme Using Lagrange Interpolating Polynomial
1, Department of Mathematics, University of Sargodha, Sargodha, Pakistan Department of Mathematics, COMSATS Institute of Information Technology, Sahiwal, Pakistan [email protected]; [email protected]; [email protected] ABSTRACT. This paper presents the general formula for surface subdivision scheme to subdivide quad meshes by using Lagrange interpolating polynomial. We can see t...
متن کاملOn the Exponent of Triple Tensor Product of p-Groups
The non-abelian tensor product of groups which has its origins in algebraic K-theory as well as inhomotopy theory, was introduced by Brown and Loday in 1987. Group theoretical aspects of non-abelian tensor products have been studied extensively. In particular, some studies focused on the relationship between the exponent of a group and exponent of its tensor square. On the other hand, com...
متن کاملCan fusion coefficients be calculated from the depth rule ?
The depth rule is a level truncation of tensor product coefficients expected to be sufficient for the evaluation of fusion coefficients. We reformulate the depth rule in a precise way, and show how, in principle, it can be used to calculate fusion coefficients. However, we argue that the computation of the depth itself, in terms of which the constraints on tensor product coefficients is formula...
متن کاملA Meta Scheme for Iterative Re nement of Meshes
Subdivision is a powerful method for smooth visualization of coarse meshes. An initial mesh of arbitrary topology is subsequently subdivided until the surface appears smooth and visually pleasing. Because of the simplicity of the algorithms and their data structure they have achieved much attention. Most schemes exhibit undesirable artifacts in the case of irregular topology. A more general des...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کامل